An Implicitly Restarted Symplectic Lanczos Method for the Symplectic Eigenvalue Problem
نویسندگان
چکیده
An implicitly restarted symplectic Lanczos method for the symplectic eigenvalue problem is presented. The Lanczos vectors are constructed to form a symplectic basis. The inherent numerical diiculties of the symplectic Lanczos method are addressed by inexpensive implicit restarts. The method is used to compute some eigenvalues and eigenvectors of large and sparse symplectic matrices.
منابع مشابه
A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm for the Hamiltonian eigenvalue problem. This allows to easily implement a purging and locking strategy in order to improve the convergence properties of the symplectic Lanczos algorithm. The Krylov-Schur-like restarting is based on the SR algorithm. Some ingredients of the latter need to be adapt...
متن کاملAn Implicitly Restarted Lanczos Method for Large Symmetric Eigenvalue Problems
The Lanczos process is a well known technique for computing a few, say k, eigenvalues and associated eigenvectors of a large symmetric n×n matrix. However, loss of orthogonality of the computed Krylov subspace basis can reduce the accuracy of the computed approximate eigenvalues. In the implicitly restarted Lanczos method studied in the present paper, this problem is addressed by fixing the num...
متن کاملThick-Restart Lanczos Method for Symmetric Eigenvalue Problems
For real symmetric eigenvalue problems, there are a number of algorithms that are mathematically equivalent, for example, the Lanczos algorithm, the Arnoldi method and the unpreconditioned Davidson method. The Lanczos algorithm is often preferred because it uses signiicantly fewer arithmetic operations per iteration. To limit the maximum memory usage, these algorithms are often restarted. In re...
متن کاملEfficient Computation of the Maximum Eigenvalue of Large Symmetric Matrices
Though the implicitly restarted Arnoldi/Lanczos method in ARPACK is a reliable method for computing a few eigenvalues of large-scale matrices, it can be inefficient because it only checks for convergence at restarts. Significant savings in runtime can be obtained by checking convergence at each Lanczos iteration. We describe a new convergence test for the maximum eigenvalue that is numerically ...
متن کاملImplicitly Restarted Arnoldi/lanczos Methods for Large Scale Eigenvalue Calculations
This report provides an introductory overview of the numerical solution of large scale algebraic eigenvalue problems. The main focus is on a class of methods called Krylov subspace projection methods. The Lanczos method is the premier member of this class and the Arnoldi method is a generalization to the nonsymmetric case. A recently developed and very promising variant of the Arnoldi/Lanczos s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 22 شماره
صفحات -
تاریخ انتشار 2001